Vertex cover

Results: 204



#Item
21Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1

Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2011-07-20 16:50:25
22Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas

Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2014-09-25 06:28:22
23On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´

On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:58
24Microsoft Wordtext.nativedoc

Microsoft Wordtext.nativedoc

Add to Reading List

Source URL: web.uvic.ca

Language: English - Date: 2012-11-03 03:43:42
25The breakpoint distance for signed sequences (extended abstract) Guillaume Blin1 , Cedric Chauve2 and Guillaume Fertin1 1 2

The breakpoint distance for signed sequences (extended abstract) Guillaume Blin1 , Cedric Chauve2 and Guillaume Fertin1 1 2

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:56:58
26Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*

Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2015-11-19 07:35:47
27Max-Min Relations in Combinatorial Optimization Jos´e Soto October 6, 2010 Max-Min Relations in Combinatorial Optimization

Max-Min Relations in Combinatorial Optimization Jos´e Soto October 6, 2010 Max-Min Relations in Combinatorial Optimization

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:22
28Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2013-01-07 10:28:15
29Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Add to Reading List

Source URL: www.levreyzin.com

Language: English - Date: 2016-07-01 10:19:11
30CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-15 10:47:56